Higher Chain Formula proved by Combinatorics

نویسنده

  • Tsoy-Wo Ma
چکیده

We present an elementary combinatorial proof of a formula to express the higher partial derivatives of composite functions in terms of those of factor functions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A q-analogue of a formula of Hernandez obtained by inverting a result of Dilcher

We prove a q-analogue of the formula by inverting a formula due to Dilcher. 1 The identities Hernandez in [6] proved the following identity:

متن کامل

Jumping Numbers of Hyperplane Arrangements

M. Saito [S] proved that the jumping numbers of a hyperplane arrangement depend only on the combinatorics of the arrangement. However, a formula in terms of the combinatorial data was still missing. In this note, we give a formula and a different proof of the fact that the jumping numbers of a hyperplane arrangement depend only on the combinatorics. We also give a combinatorial formula for part...

متن کامل

On Combinatorics of Quiver Component Formulas

Buch and Fulton [7] conjectured the nonnegativity of the quiver coefficients appearing in their formula for a quiver variety. Knutson, Miller and Shimozono [21] proved this conjecture as an immediate consequence of their “component formula”. We present an alternative proof of the component formula by substituting combinatorics for Gröbner degeneration [21, 20]. We relate the component formula t...

متن کامل

Noncrossing partitions with fixed points

The noncrossing partitions with each of their blocks containing a given element are introduced and studied. The enumeration of these partitions is described through a polynomial of several variables which is proved to satisfy a recursive formula. It is shown that each variable increased by one is a factor of this polynomial.

متن کامل

Constructive lower bounds for Ramsey numbers from linear graphs

Giraud (1968) demonstrated a process for constructing cyclic Ramsey graph colourings, starting from a known cyclic ‘prototype’ colouring, adding edges of a single new colour, and producing a larger cyclic pattern. This paper describes an extension of that construction which allows any number of new colours to be introduced simultaneously, by using two multicolour prototypes, each of which is a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2009